Relaxed Safeness in Datalog-Based Policies
نویسندگان
چکیده
This paper presents a safeness condition that is more liberal than the one commonly imposed on Datalog, based on classifying predicate arguments into input and output arguments, thereby extending the expressiveness of Datalog-based policy languages. It is also shown that the relaxed safeness condition is a powerful tool for adding important features to such languages.
منابع مشابه
DL+log: Tight Integration of Description Logics and Disjunctive Datalog
The integration of Description Logics and Datalog rules presents many semantic and computational problems. In particular, reasoning in a system fully integrating Description Logics knowledge bases (DL-KBs) and Datalog programs is undecidable. Many proposals have overcomed this problem through a “safeness” condition that limits the interaction between the DL-KB and the Datalog rules. Such a safe...
متن کاملThe DReW System for Nonmonotonic DL-Programs
Nonmonotonic DL-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, in most systems for DL-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as most fragments of OWL 2 RL, OWL 2 EL, and O...
متن کاملDatalog: Datalog Rules Parameterized by Description Logics
Combining ontologies with rules has become a central topic in the Semantic Web. Bridging the discrepancy between these two knowledge representations, this paper introduces Datalog as a family of hybrid languages, where Datalog rules are parameterized by various DL (description logic) languages ranging from ALC to SHIQ . Making Datalog a decidable system with complexity of EXPTIME, we propose in...
متن کاملOn Combining Description Logic Ontologies and Nonrecursive Datalog Rules
Reasoning in systems integrating Description Logics (DL) ontologies and Datalog rules is a very hard task, and previous studies have shown undecidability of reasoning in systems integrating (even very simple) DL ontologies with recursive Datalog. However, the results obtained so far constitute a very partial picture of the computational properties of systems combining DL ontologies and Datalog ...
متن کاملDatalogDL: Datalog Rules Parameterized by Description Logics
Combining ontologies with rules has become a central topic in the Semantic Web. Bridging the discrepancy between these two knowledge representations, this paper introduces Datalog as a family of hybrid languages, where Datalog rules are parameterized by various DL (description logic) languages ranging from ALC to SHIQ . Making Datalog a decidable system with complexity of EXPTIME, we propose in...
متن کامل